Distribution of shortest paths in percolation
نویسندگان
چکیده
We present a scaling Ansatz for the distribution function of the shortest paths connecting any two points on a percolating cluster which accounts for (i) the e ect of the nite size of the system, and (ii) the dependence of this distribution on the site occupancy probability p. We present evidence supporting the scaling Ansatz for the case of two-dimensional percolation. c © 1999 Elsevier Science B.V. All rights reserved. PACS: 64.60.A
منابع مشابه
Active Distribution Networks Restoration after Extreme Events
After extreme events such as floods, thunderstorms, blizzards and hurricanes there will be devastating effects in the distribution networks which may cause a partial or complete blackout. Then, the major concern for the system operators is to restore the maximum critical loads as soon as possible by available generation units. In order to solve this problem, this paper provides a restoration s...
متن کاملUniversality for first passage percolation on sparse random graphs
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a uniform X logX-condition, we analyze the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well the number of edges...
متن کاملMapping spreading dynamics: From time respecting shortest paths to bond percolation
We propose a mapping of spreading dynamics to an ensemble of weighted networks, where edge weights represent propagation time delays. In this mapping, shortest paths in the weighted networks preserve the temporal causality of spreading. Furthermore, for efficient sampling, we construct a Markov Chain (Gibbs sampler) over elements of an ensemble of mapped weighted networks. Our framework provide...
متن کاملPair Connectedness and Shortest Path Scaling in Critical Percolation
We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For d = 2 they clearly disprove a recent conjecture by M. Porto et al., Phys. Rev. E 58, R5205 (1998). Our data also provide upper bounds on the probability that two near-by points are ...
متن کاملNondifferentiability of the Time Constants of First-passage Percolation
We study the paths of minimal cost for first-passage percolation in two dimensions and obtain an exponential bound on the tail probability of the ratio of the lengths of the shortest and longest of these. This inequality permits us to answer a long-standing question of Hammersley andWelsh (1965) on the shift differentiability of the time constant. Specifically, we show that for subcritcal Berno...
متن کامل